Semi - Stable Semantics 1
نویسنده
چکیده
In this paper, we examine an argument-based semantics called semistable semantics. Semi-stable semantics is quite close to traditional stable semantics in the sense that every stable extension is also a semi-stable extension. One of the advantages of semi-stable semantics is that there exists at least one semi-stable extension. Furthermore, if there also exists at least one stable extension, then the semi-stable extensions coincide with the stable extensions. This, and other properties, make semi-stable semantics an attractive alternative for the more traditional stable semantics, which until now has been widely used in fields such as logic programming and answer set programming.
منابع مشابه
An Algorithm for Computing Semi-stable Semantics
The semi-stable semantics for formal argumentation has been introduced as a way of approximating stable semantics in situations where no stable extensions exist. Semi-stable semantics can be located between stable semantics and preferred semantics in the sense that every stable extension is a semi-stable extension and every semi-stable extension is a preferred extension. Moreover, in situations...
متن کاملSemi-Stable Semantics
In this paper, we examine an argument-based semantics called semi-stable semantics. Semi-stable semantics is quite close to traditional stable semantics in the sense that every stable extension is also a semi-stable extension. One of the advantages of semi-stable semantics is that for finite argumentation frameworks there always exists at least one semi-stable extension. Furthermore, if there a...
متن کاملOn the Existence of Semi-Stable Extensions
In this paper, we describe an open problem in abstract argumentation theory: the precise conditions under which semi-stable extensions exist. Although each finite argumentation framework can be shown to have at least one semi-stable extension, this is no longer the case when infinite argumentation frameworks are considered. This puts semi-stable semantics between stable and preferred semantics....
متن کاملComplexity of semi-stable and stage semantics in argumentation frameworks
In this work, we answer two questions about the complexity of semi-stable semantics for abstract argumentation frameworks: we show Π2 -completeness for the problem of deciding whether an argument is skeptically accepted, and respectively, ΣP2 completeness for the problem of deciding whether an argument is credulously accepted under the semi-stable semantics. Furthermore, we extend these complex...
متن کاملWell Founded Semantics and Stable Semantics of Semi-Strict Programs
In this paper we exhibit a condition on the syntax of the logic programs with negation, the semi-strictness property, which assures the equivalence of the well founded semantics and the stable semantics: so, for semi-strict programs the well founded model is total if and only if the program has an unique stable model.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003